TSTP Solution File: ITP087^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP087^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:16:14 EDT 2024

% Result   : Theorem 5.31s 1.15s
% Output   : CNFRefutation 5.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   34 (  16 unt;  14 typ;   0 def)
%            Number of atoms       :   36 (   6 equ;   0 cnn)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  136 (  18   ~;  13   |;   0   &; 102   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    secrecy_specID: $tType ).

thf(decl_sort2,type,
    set_Secrecy_KS: $tType ).

thf(decl_sort3,type,
    secrecy_KS: $tType ).

thf(decl_sort4,type,
    set_Secrecy_specID: $tType ).

thf(decl_40,type,
    bot_bo1785112429specID: set_Secrecy_specID ).

thf(decl_42,type,
    correctCompositionKS: secrecy_specID > $o ).

thf(decl_55,type,
    specKeysSecrets: secrecy_specID > set_Secrecy_KS ).

thf(decl_71,type,
    insert1671894227specID: secrecy_specID > set_Secrecy_specID > set_Secrecy_specID ).

thf(decl_89,type,
    subcomponents: secrecy_specID > set_Secrecy_specID ).

thf(decl_90,type,
    member_Secrecy_KS: secrecy_KS > set_Secrecy_KS > $o ).

thf(decl_95,type,
    p: secrecy_specID ).

thf(decl_96,type,
    pq: secrecy_specID ).

thf(decl_97,type,
    q: secrecy_specID ).

thf(decl_99,type,
    m: secrecy_KS ).

thf(fact_7_correctCompositionKS__PQ,axiom,
    ! [X1: secrecy_specID,X2: secrecy_specID,X3: secrecy_specID,X4: secrecy_KS] :
      ( ( ( subcomponents @ X1 )
        = ( insert1671894227specID @ X2 @ ( insert1671894227specID @ X3 @ bot_bo1785112429specID ) ) )
     => ( ( correctCompositionKS @ X1 )
       => ( ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X1 ) )
         => ( ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X2 ) )
            | ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_correctCompositionKS__PQ) ).

thf(fact_2_notKSP,axiom,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_notKSP) ).

thf(fact_1_notKSQ,axiom,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ q ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_notKSQ) ).

thf(fact_3_subPQ,axiom,
    ( ( subcomponents @ pq )
    = ( insert1671894227specID @ p @ ( insert1671894227specID @ q @ bot_bo1785112429specID ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_subPQ) ).

thf(conj_0,conjecture,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ pq ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_0_cCompKS,axiom,
    correctCompositionKS @ pq,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_cCompKS) ).

thf(c_0_6,plain,
    ! [X1400: secrecy_specID,X1401: secrecy_specID,X1402: secrecy_specID,X1403: secrecy_KS] :
      ( ( ( subcomponents @ X1400 )
       != ( insert1671894227specID @ X1401 @ ( insert1671894227specID @ X1402 @ bot_bo1785112429specID ) ) )
      | ~ ( correctCompositionKS @ X1400 )
      | ~ ( member_Secrecy_KS @ X1403 @ ( specKeysSecrets @ X1400 ) )
      | ( member_Secrecy_KS @ X1403 @ ( specKeysSecrets @ X1401 ) )
      | ( member_Secrecy_KS @ X1403 @ ( specKeysSecrets @ X1402 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_7_correctCompositionKS__PQ])])]) ).

thf(c_0_7,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ p ) ),
    inference(fof_simplification,[status(thm)],[fact_2_notKSP]) ).

thf(c_0_8,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ q ) ),
    inference(fof_simplification,[status(thm)],[fact_1_notKSQ]) ).

thf(c_0_9,plain,
    ! [X3: secrecy_specID,X4: secrecy_KS,X2: secrecy_specID,X1: secrecy_specID] :
      ( ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X2 ) )
      | ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X3 ) )
      | ( ( subcomponents @ X1 )
       != ( insert1671894227specID @ X2 @ ( insert1671894227specID @ X3 @ bot_bo1785112429specID ) ) )
      | ~ ( correctCompositionKS @ X1 )
      | ~ ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ( ( subcomponents @ pq )
    = ( insert1671894227specID @ p @ ( insert1671894227specID @ q @ bot_bo1785112429specID ) ) ),
    inference(split_conjunct,[status(thm)],[fact_3_subPQ]) ).

thf(c_0_11,negated_conjecture,
    member_Secrecy_KS @ m @ ( specKeysSecrets @ pq ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_12,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ p ) ),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

thf(c_0_13,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ q ) ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

thf(c_0_14,plain,
    ! [X4: secrecy_KS,X1: secrecy_specID] :
      ( ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ p ) )
      | ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ q ) )
      | ( ( subcomponents @ X1 )
       != ( subcomponents @ pq ) )
      | ~ ( member_Secrecy_KS @ X4 @ ( specKeysSecrets @ X1 ) )
      | ~ ( correctCompositionKS @ X1 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_15,negated_conjecture,
    member_Secrecy_KS @ m @ ( specKeysSecrets @ pq ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_16,plain,
    correctCompositionKS @ pq,
    inference(split_conjunct,[status(thm)],[fact_0_cCompKS]) ).

thf(c_0_17,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ p ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_18,plain,
    ~ ( member_Secrecy_KS @ m @ ( specKeysSecrets @ q ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ITP087^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat May 18 15:25:38 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.31/1.15  # Version: 3.1.0-ho
% 5.31/1.15  # Preprocessing class: HSLSSMSMSSMNSFA.
% 5.31/1.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.15  # Starting new_ho_3 with 1500s (5) cores
% 5.31/1.15  # Starting pre_casc_2 with 300s (1) cores
% 5.31/1.15  # Starting additional_ho_7 with 300s (1) cores
% 5.31/1.15  # Starting lpo8_s with 300s (1) cores
% 5.31/1.15  # new_ho_3 with pid 31089 completed with status 0
% 5.31/1.15  # Result found by new_ho_3
% 5.31/1.15  # Preprocessing class: HSLSSMSMSSMNSFA.
% 5.31/1.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.15  # Starting new_ho_3 with 1500s (5) cores
% 5.31/1.15  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 5.31/1.15  # Search class: HGHSM-FSLM32-SSFFFFBN
% 5.31/1.15  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.15  # Starting new_bool_3 with 811s (1) cores
% 5.31/1.15  # Starting new_ho_3 with 151s (1) cores
% 5.31/1.15  # Starting new_bool_1 with 136s (1) cores
% 5.31/1.15  # Starting new_bool_4 with 136s (1) cores
% 5.31/1.15  # Starting sh9 with 136s (1) cores
% 5.31/1.15  # new_ho_3 with pid 31095 completed with status 0
% 5.31/1.15  # Result found by new_ho_3
% 5.31/1.15  # Preprocessing class: HSLSSMSMSSMNSFA.
% 5.31/1.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.15  # Starting new_ho_3 with 1500s (5) cores
% 5.31/1.15  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 5.31/1.15  # Search class: HGHSM-FSLM32-SSFFFFBN
% 5.31/1.15  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.15  # Starting new_bool_3 with 811s (1) cores
% 5.31/1.15  # Starting new_ho_3 with 151s (1) cores
% 5.31/1.15  # Preprocessing time       : 0.007 s
% 5.31/1.15  # Presaturation interreduction done
% 5.31/1.15  
% 5.31/1.15  # Proof found!
% 5.31/1.15  # SZS status Theorem
% 5.31/1.15  # SZS output start CNFRefutation
% See solution above
% 5.31/1.15  # Parsed axioms                        : 447
% 5.31/1.15  # Removed by relevancy pruning/SinE    : 149
% 5.31/1.15  # Initial clauses                      : 621
% 5.31/1.15  # Removed in clause preprocessing      : 25
% 5.31/1.15  # Initial clauses in saturation        : 596
% 5.31/1.15  # Processed clauses                    : 6539
% 5.31/1.15  # ...of these trivial                  : 115
% 5.31/1.15  # ...subsumed                          : 4544
% 5.31/1.15  # ...remaining for further processing  : 1880
% 5.31/1.15  # Other redundant clauses eliminated   : 257
% 5.31/1.15  # Clauses deleted for lack of memory   : 0
% 5.31/1.15  # Backward-subsumed                    : 66
% 5.31/1.15  # Backward-rewritten                   : 10
% 5.31/1.15  # Generated clauses                    : 24684
% 5.31/1.15  # ...of the previous two non-redundant : 22143
% 5.31/1.15  # ...aggressively subsumed             : 0
% 5.31/1.15  # Contextual simplify-reflections      : 25
% 5.31/1.15  # Paramodulations                      : 24427
% 5.31/1.15  # Factorizations                       : 21
% 5.31/1.15  # NegExts                              : 0
% 5.31/1.15  # Equation resolutions                 : 274
% 5.31/1.15  # Disequality decompositions           : 0
% 5.31/1.15  # Total rewrite steps                  : 11350
% 5.31/1.15  # ...of those cached                   : 10457
% 5.31/1.15  # Propositional unsat checks           : 0
% 5.31/1.15  #    Propositional check models        : 0
% 5.31/1.15  #    Propositional check unsatisfiable : 0
% 5.31/1.15  #    Propositional clauses             : 0
% 5.31/1.15  #    Propositional clauses after purity: 0
% 5.31/1.15  #    Propositional unsat core size     : 0
% 5.31/1.15  #    Propositional preprocessing time  : 0.000
% 5.31/1.15  #    Propositional encoding time       : 0.000
% 5.31/1.15  #    Propositional solver time         : 0.000
% 5.31/1.15  #    Success case prop preproc time    : 0.000
% 5.31/1.15  #    Success case prop encoding time   : 0.000
% 5.31/1.15  #    Success case prop solver time     : 0.000
% 5.31/1.15  # Current number of processed clauses  : 1356
% 5.31/1.15  #    Positive orientable unit clauses  : 83
% 5.31/1.15  #    Positive unorientable unit clauses: 11
% 5.31/1.15  #    Negative unit clauses             : 41
% 5.31/1.15  #    Non-unit-clauses                  : 1221
% 5.31/1.15  # Current number of unprocessed clauses: 16284
% 5.31/1.15  # ...number of literals in the above   : 57210
% 5.31/1.15  # Current number of archived formulas  : 0
% 5.31/1.15  # Current number of archived clauses   : 440
% 5.31/1.15  # Clause-clause subsumption calls (NU) : 392856
% 5.31/1.15  # Rec. Clause-clause subsumption calls : 222386
% 5.31/1.15  # Non-unit clause-clause subsumptions  : 3768
% 5.31/1.15  # Unit Clause-clause subsumption calls : 3383
% 5.31/1.15  # Rewrite failures with RHS unbound    : 0
% 5.31/1.15  # BW rewrite match attempts            : 169
% 5.31/1.15  # BW rewrite match successes           : 123
% 5.31/1.15  # Condensation attempts                : 6539
% 5.31/1.15  # Condensation successes               : 27
% 5.31/1.15  # Termbank termtop insertions          : 378793
% 5.31/1.15  # Search garbage collected termcells   : 16014
% 5.31/1.15  
% 5.31/1.15  # -------------------------------------------------
% 5.31/1.15  # User time                : 0.608 s
% 5.31/1.15  # System time              : 0.027 s
% 5.31/1.15  # Total time               : 0.635 s
% 5.31/1.15  # Maximum resident set size: 5216 pages
% 5.31/1.15  
% 5.31/1.15  # -------------------------------------------------
% 5.31/1.15  # User time                : 2.991 s
% 5.31/1.15  # System time              : 0.114 s
% 5.31/1.15  # Total time               : 3.105 s
% 5.31/1.15  # Maximum resident set size: 2600 pages
% 5.31/1.15  % E---3.1 exiting
% 5.31/1.15  % E exiting
%------------------------------------------------------------------------------